Using Answer Set Programming in an Inference-Based approach to Natural Language Semantics

نویسندگان

Farid Nouioua

Pascal Nicolas

چکیده

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Using Answer Set Programming in an Inference-Based approach to Natural Language Semantics Farid Nouioua, Pascal Nicolas

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Declarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey

One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...

متن کامل

Temporally Expressive Planning Based on Answer Set Programming with Constraints

Recently, a new language AC(C) was proposed to integrate answer set programming (ASP) and constraint logic programming (CLP). In this paper, we show that temporally expressive planning problems in PDDL2.1 can be translated into AC(C) and solved using AC(C) solvers. Compared with existing approaches, the new approach puts less restrictions on the planning problems and is easy to extend with new ...

متن کامل

Learning an Optimal Sequence of Questions for the Disambiguation of Queries over Structured Data

Intelligent systems interacting with users often need to relate ambiguous natural language phrases to formal entities which can be further processed. This work strives for learning an optimal sequence of disambiguation questions asked by an agent in order to achieve a perfect interactive disambiguation, setting itself off against previous work on interactive and adaptive dialogue systems for di...

متن کامل

Probabilistic Inductive Logic Programming Based on Answer Set Programming

We propose a new formal language for the expressive representation of probabilistic knowledge based on Answer Set Programming (ASP). It allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities and for learning of such weights from data (parameter estimation). Weighted formulas are given a semantics in terms of soft and hard constraints which determine ...

متن کامل